Finite-Geometry Low-Density Parity-Check Codes for Channels with Stuck-at Defects

نویسندگان

  • Guang-Chong Zhu
  • Wei Yu
  • Frank R. Kschischang
چکیده

We investigate the use of finite-geometry low-density parity-check (FG-LDPC) codes for channels with stuckat defects. Such a channel is corrupted by a stuck-at defect pattern in addition to the usual channel-induced noise. When the defect pattern is known to the encoder but not to the decoder, the capacity of the channel is the same as if the defect pattern were also revealed to the decoder. Capacity-achieving codes for such channels require a good quantization code embedded inside a good errorcorrecting code. The main idea of this paper is that such an embedding may be realized by taking advantage of the cyclic or quasi-cyclic structure of FG-LDPC codes, which allows a quantization codes with low trellis complexity to be constructed. Combining this with the good errorcorrecting capability of low-density parity-check codes, we demonstrate that FG-LDPC codes offers good performance on channels with stuck-at defects.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Low Density Parity Check Codes Based on Finite Geometries: A Rediscovery and New Results1

This paper presents a geometric approach to the construction of low density parity check (LDPC) codes. Four classes of LDPC codes are constructed based on the lines and points of Euclidean and projective geometries over finite fields. Codes of these four classes have good minimum distances and their Tanner graphs have girth 6. Finite geometry LDPC codes can be decoded in various ways, ranging f...

متن کامل

Regular low-density parity-check codes from oval designs

This paper presents a construction of low-density parity-check (LDPC) codes based on the incidence matrices of oval designs. The new LDPC codes have regular parity-check matrices and Tanner graphs free of 4-cycles. Like the finite geometry codes, the codes from oval designs have parity-check matrices with a large proportion of linearly dependent rows and can achieve significantly better minimum...

متن کامل

Low-density parity-check codes based on finite geometries: A rediscovery and new results

This paper presents a geometric approach to the construction of low-density parity-check (LDPC) codes. Four classes of LDPC codes are constructed based on the lines and points of Euclidean and projective geometries over finite fields. Codes of these four classes have good minimum distances and their Tanner graphs have girth 6. Finite-geometry LDPC codes can be decoded in various ways, ranging f...

متن کامل

Low complexity decoding of finite geometry LDPC codes

We develop a new low complexity algorithm for decoding low-density parity-check (LDPC) codes. The developments are oriented specifically toward the low cost -yet effectivedecoding of (high rate) finite geometry LDPC codes. The decoding procedure updates the hard-decision received vector iteratively in search of a valid codeword in the vector space. Only one bit is changed in each iteration and ...

متن کامل

Sparse Low-Density Parity-Check Codes for Channels with Cross-Talk

Low-density parity-check codes are modified to produce transmissions in which the symbols 1 and 0 are used with different frequencies. These codes are good candidates for multi-user channels with crosstalk, such as optical channels.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005